Complexity Theory in Axiomatic Design
نویسندگان
چکیده
During the last couple of decades, the term complexity has been commonly found in use in many fields of science, sometimes as a measurable quantity with a rigorous but narrow definition and other times as merely an ad hoc label. With an emphasis on pragmatic engineering applications, this thesis investigates the complexity concept defined in axiomatic design theory to avoid vague use of the term ’complexity’ in engineering system design, to provide deeper insight into possible causes of complexity, and to develop a systematic approach to complexity reduction. The complexity concept in axiomatic design theory is defined as a measure of uncertainty in achieving a desired set of functional requirements. In this thesis, it is revisited to refine its definition. Four different types of complexity are identified in axiomatic design complexity theory: time-independent real complexity, timeindependent imaginary complexity, time-dependent combinatorial complexity and time-dependent periodic complexity. Time-independent real complexity is equivalent to the information content, which is a measure of a probability of achieving functional requirements. Time-independent imaginary complexity is defined as the uncertainty due to ignorance of the interactions between functional requirements and design parameters. Time-dependent complexity consists of combinatorial complexity and periodic complexity, depending on whether the uncertainty increases indefinitely or occasionally stops increasing at certain point and returns to the initial level of uncertainty. In this thesis, existing definitions for each of the types of complexity are further elaborated with a focus on time-dependent complexity. In particular, timedependent complexity is clearly defined using the concepts of time-varying system ranges and time-dependent sets of functional requirements. Clear definition of the complexity concept that properly addresses the causes of complexity leads to a systematic approach for complexity reduction. As techniques for reducing time-independent complexity are known within and beyond axiomatic design theory, this thesis focuses on dealing with time-dependent complexity. From the definition of time-dependent complexity, combinatorial complexity must be transformed into periodic complexity to prevent the uncertainty from growing unboundedly. Timedependence of complexity is attributed to two factors. One is a time-varying system
منابع مشابه
A Lean Manufacturing Roadmap for an Automotive Body Assembly Line within Axiomatic Design Framework
In this paper we are to present a practical application of Axiomatic Design (AD) methodology, as a roadmap to lean production, in redesigning a car body assembly line. Axiomatic Design theory provides a framework to simplify the whole problem. According to the AD principles, a hierarchical structure has been developed. The developed structure originated in lean manufacturing principles and exis...
متن کاملGlobal Software Development: Measuring, Approximating and Reducing the Complexity of Global Software Development Using Extended Axiomatic Design Theory
This paper considers GSD projects as designed artefacts, and proposes the application of an Extended Axiomatic Design theory to reduce their complexity in order to increase the probability of project success. Using an upper bound estimation of the Kolmogorov complexity of the so-called ‘design matrix’ (as a proxy of Information Content as a complexity measure) we demonstrate on two hypothetical...
متن کاملGlobal Software Development: Measuring, Approximating and Reducing the Complexity of Global Software Development Using Extended Axiomatic Design Theory
This paper considers GSD projects as designed artefacts, and proposes the application of an Extended Axiomatic Design theory to reduce their complexity in order to increase the probability of project success. Using an upper bound estimation of the Kolmogorov complexity of the so-called ‘design matrix’ (as a proxy of Information Content as a complexity measure) we demonstrate on two hypothetical...
متن کاملGlobal Software Development: Measuring, Approximating and Reducing the Complexity of Global Software Development Using Extended Axiomatic Design Theory
This paper considers GSD projects as designed artefacts, and proposes the application of an Extended Axiomatic Design theory to reduce their complexity in order to increase the probability of project success. Using an upper bound estimation of the Kolmogorov complexity of the so-called ‘design matrix’ (as a proxy of Information Content as a complexity measure) we demonstrate on two hypothetical...
متن کاملGlobal Software Development: Measuring, Approximating and Reducing the Complexity of Global Software Development Using Extended Axiomatic Design Theory
This paper considers GSD projects as designed artefacts, and proposes the application of an Extended Axiomatic Design theory to reduce their complexity in order to increase the probability of project success. Using an upper bound estimation of the Kolmogorov complexity of the so-called ‘design matrix’ (as a proxy of Information Content as a complexity measure) we demonstrate on two hypothetical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003